Multigraded Cayley-Chow forms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Cayley-chow Coordinates and Computer Vision

A fundamental problem in computer vision is to reconstruct the configuration of a collection of cameras from the images they have taken of a common subject. If we model a camera as a linear projection from projective 3-space to the projective plane, this problem can be rephrased algebrogeometrically in terms of recovering a subvariety of a product of projective planes. Both the equations defini...

متن کامل

The Chow Ring of the Cayley Plane

We give a full description of the Chow ring of the complex Cayley plane OP. For this, we describe explicitely the most interesting of its Schubert varieties and compute their intersection products. Translating our results in the Borel presentation, i.e. in terms of Weyl group invariants, we are able to compute the degree of the variety of reductions Y8 introduced in [6].

متن کامل

Remarks on the Cayley–van Der Waerden–chow Form

It is known that a variety in projective space is uniquely determined by its Cayley–van der Waerden–Chow form. An algebraic formulation and a proof (for an arbitrary base field) of this classical result are given in view of applications to the Stückrad–Vogel intersection cycle.

متن کامل

Computing Chow Forms and Some Applications

We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of the greatest dimension of an algebraic (projective or affine) variety can be computed. The complexi...

متن کامل

The Zarankiewicz Problem via Chow Forms

The well-known Zarankiewicz problem [Za] is to determine the least positive integer Z(m,n, r, s) such that each m × n 0-1 matrix containing Z(m,n, r, s) ones has an r × s submatrix consisting entirely of ones. In graph-theoretic language, this is equivalent to finding the least positive integer Z(m, n, r, s) such that each bipartite graph on m black vertices and n white vertices with Z(m,n, r, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2019

ISSN: 0001-8708

DOI: 10.1016/j.aim.2019.03.010